The Data Complexity of MDatalog in Basic Modal Logics

نویسنده

Linh Anh Nguyen

چکیده

We study the data complexity of the modal query language MDatalog and its extension eMDatalog in basic modal logics. MDatalog is a modal extension of Datalog, while eMDatalog is the general modal Horn fragment with the allowedness condition. As the main results, we prove that the data complexity of MDatalog and eMDatalog in K4, KD4, and S4 is PSPACE-complete, in K is coNP-complete, and in KD , T , KB , KDB , and B is PTIME-complete.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Summary of the Habilitation Thesis

In [H1], we develop a fixpoint semantics, the least model semantics, and an SLDresolution calculus in a direct way for positive modal logic programs in basic serial monomodal logics. In [H2], we extend the results and generalize the methods of [H1] for multimodal logics, giving a framework for developing semantics for positive logic programs in serial multimodal logics. In [H3], we report on ou...

متن کامل

On Modal Deductive Databases

We present a query language called MDatalog, which is an extension of Datalog for multimodal deductive databases. We define modal relational algebras and give the seminaive evaluation algorithm and the magic-set transformation for MDatalog queries. Results of this paper are proved for the multimodal logics of belief KDI4s5, KDI45, KD4s5s, KD45(m), which are extensions of the monomodal logic KD4...

متن کامل

Foundations of Modal Deductive Databases ∗ Linh

We give formulations for modal deductive databases and present a modal query language called MDatalog. We define modal relational algebras and give the seminaive evaluation algorithm, the top-down evaluation algorithm, and the magic-set transformation for MDatalog queries. The results of this paper like soundness and completeness of the top-down evaluation algorithm or correctness of the magic-...

متن کامل

The Modal Query Language MDatalog

We propose a modal query language called MDatalog. A rule of an MDatalog program is a universally quantified modal Horn clause. This language is interpreted in fixed-domain first-order modal logics over signatures without functions. We give algorithms to construct the least models for MDatalog programs. We show PTIME complexity of computing queries for a given MDatalog program in the logics KD,...

متن کامل